Dynamic Programming for Computing Power Indices for Weighted Voting Games with Precoalitions

We study the efficient computation of power indices for weighted voting games with precoalitions amongst subsets players (reflecting, e.g., ideological proximity) using paradigm dynamic programming. Starting from state-of-the-art algorithms computing Banzhaf and Shapley–Shubik games, we present a framework fast three most common precoalitions, i.e., Owen index, Banzhaf–Owen index symmetric coalitional point out why our new are applicable large numbers players. discuss implementations in C++ review times, as well storage requirements.